Two function algebras defining functions in NCk boolean circuits

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean algebras and Lubell functions

Let 2 denote the power set of [n], where [n] = {1, 2, . . . , n}. A collection B ⊂ 2 forms a d-dimensional Boolean algebra if there exist pairwise disjoint sets X0, X1, . . . , Xd ⊆ [n], all non-empty with perhaps the exception of X0, so that B = { X0 ∪ ⋃ i∈I Xi : I ⊆ [d] } . Let b(n, d) be the maximum cardinality of a family F ⊂ 2 that does not contain a d-dimensional Boolean algebra. Gunderso...

متن کامل

On Functions Defined on Free Boolean Algebras

We characterize measures on free Boolean algebras and we examine the relationships that exists between measures and binary tables in relational databases. It is shown that these measures are completely defined by their values on positive conjunctions and an algorithm that leads to the construction of measures starting from its values on positive conjunction is also given, including a formula th...

متن کامل

Polynomial Threshold Functions and Boolean Threshold Circuits

We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...

متن کامل

Boolean Algebras in Visser Algebras

We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...

متن کامل

Cryptographic properties of Boolean functions defining elementary cellular automata

Department of Informatic and Automatic, E.P.S. de Zamora, Universidad de Salamanca. Avda. Cardenal Requejo 34, 49022-Zamora, Spain; Department of Applied Mathematics, E.P.S. de Ávila, Universidad de Salamanca. C/ Hornos Caleros 50,05003-Ávila, Spain; Department of Applied Mathematics, E.P.S. de Zamora, Universidad de Salamanca. Avda. Cardenal Requejo 34, 49022-Zamora, Spain; Department of Appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2016

ISSN: 0890-5401

DOI: 10.1016/j.ic.2015.12.009